Skew Heap
نویسنده
چکیده
Skew heaps are an amazingly simple and lightweight implementation of priority queues. They were invented by Sleator and Tarjan [1] and have logarithmic amortized complexity. This entry provides executable and verified functional skew heaps. The amortized complexity of skew heaps is analyzed in the AFP entry Amortized Complexity.
منابع مشابه
Self-Adjusting Heaps
In this paper we explore two themes in data structure design: amortized computational complexity and self-adjustment. We are motivated by the following observations. In most applications of data structures, we wish to perform not just a single operation but a sequence of operations, possibly having correlated behavior. By averaging the running time per operation over a worst-case sequence of op...
متن کاملA Comparative Study of Some Priority Queues Suitable for Implementation of the Pending Event Set1
Implementation of the pending event set (PES) is often crucial to the execution speed of a simulation. Parallel access implementation of the PES is a possible means of gaining performance improvement in discrete event simulation. In this paper a comparative study of some sequential and parallel access implementations of the PES is presented, these include linked lists, the Calendar Queue, the L...
متن کاملA Tight Lower Bound for Top-Down Skew Heaps
Previously, it was shown in a paper by Kaldewaij and Schoenmakers that for topdown skew heaps the amortized number of comparisons required for meld and delmin is upper bounded by logφ n, where n is the total size of the inputs to these operations and φ = ( √ 5+1)/2 denotes the golden ratio. In this paper we present worst-case sequences of operations on top-down skew heaps in which each applicat...
متن کاملVerified Analysis of Functional Data Structures
In recent work the author has analyzed a number of classical functional search tree and priority queue implementations with the help of the theorem prover Isabelle/HOL. The functional correctness proofs of AVL trees, red-black trees, 2-3 trees, 2-3-4 trees, 1-2 brother trees, AA trees and splay trees could be automated. The amortized logarithmic complexity of skew heaps, splay trees, splay heap...
متن کاملPairing Heaps with Costless Meld
Improving the structure and analysis in [1], we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an O(log log n) in [1]) and the same amortized bounds for all other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per find-min and insert, O(log n) per delete-min, and O(log log n) per decrease-key. These bounds are the best...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014